A tight analysis of the Katriel–Bodlaender algorithm for online topological ordering
نویسندگان
چکیده
منابع مشابه
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
Katriel and Bodlaender [7] modify the algorithm proposed by Alpern et al. [2] for maintaining the topological order of the n nodes of a directed acyclic graph while inserting m edges and prove that their algorithm runs in O(min{m3/2 log n,m + n log n}) time and has an Ω(m) lower bound. In this paper, we give a tight analysis of their algorithm by showing that it runs in time Θ(m + mn log n). Ge...
متن کاملAverage-Case Analysis of Online Topological Ordering
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates. All known algorithms for this problem are either only analyzed for worst-case insertion sequences or only evaluated experimentally on random DAGs. We present the first average-case analysis of online topological orde...
متن کاملAn O(n2.75) Algorithm for Online Topological Ordering
We present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n) time, independent of the number of edges m inserted. For dense DAGs, this is an improvement over the previous best result of O(min{m 2 log n,m 3 2 + n log n}) by Katriel and Bodlaender. We also provide an empirical comparison of our algorit...
متن کاملAn Õ(n)-Time Algorithm for Online Topological Ordering
We present an Õ(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) by Ajwani, Friedrich, and Meyer.
متن کاملAn Õ(n2.5)-Time Algorithm for Online Topological Ordering
We present an Õ(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) by Ajwani, Friedrich, and Meyer.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.08.009